The Mechanization of the Diagonalization Proof StrategyLassaad
نویسنده
چکیده
We present an empirical study of mathematical proofs by diagonalization, the aim is their mechanization based on proof planning techniques. We show that these proofs can be constructed according to a strategy that (i) nds an indexing relation, (ii) constructs a diagonal element, and (iii) makes the implicit contradiction of the diagonal element explicit. Moreover we suggest how diagonal elements can be represented.
منابع مشابه
Diagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملRepresenting and Reformulating Diagonalization Methods
Finding an appropriate representation of planning operators is crucial for theorem provers that work with proof planning. We show a new representation of operators and demonstrate how diagonalization can be represented by operators. We explain how a diagonalization operator used in one proof-plan can be analogically transferred to an operator used in another proof-plan. Finally, we nd an operat...
متن کاملSeki Report Planning Diagonalization Proofs Planning Diagonalization Proofs
This report is a rst attempt of formalizing the diagonalization proof technique. We give a strategy how to systematically construct diagonalization proofs: (i) nding an indexing relation, (ii) constructing a diagonal element, and (iii) making the implicit contradiction of the diagonal element explicit. We suggest a declarative representation of the strategy and describe how it can be realized i...
متن کاملPlanning Diagonalization Proofs
Proof planning is a novel knowledge-based approach for proof construction, which supports the incorporation of mathematical knowledge and the common mathematical proof techniques of a particular mathematical eld. The diagonalization proof technique is a well-known method in theoretical computer science and in mathematics that originated with Can-tor, who used it to show his seminal uncountabili...
متن کاملApplication of an integrated decision-making approach based on FDAHP and PROMETHEE for selection of optimal coal seam for mechanization; A case study of the Tazareh coal mine complex, Iran
Increasing the production rate and minimizing the related costs, while optimizing the safety measures, are nowadays’ most important tasks in the mining industry. To these ends, mechanization of mines could be applied, which can result in significant cost reductions and higher levels of profitability for underground mines. The potential of a coal mine mechanization depends on some important fact...
متن کامل